An efficient Lagrange multiplier search algorithm for Optimal Spectrum Balancing in crosstalk dominated xDSL systems

نویسندگان

  • Paschalis Tsiaflakis
  • Jan Vangorp
  • Marc Moonen
  • Jan Verlinden
  • Katleen Van Acker
  • Raphael Cendrillon
چکیده

In modern DSL systems, multi-user crosstalk is the major source of performance degradation. Optimal Spectrum Balancing (OSB) is a centralized algorithm that optimally allocates the available transmit power over frequencies, thereby mitigating the effect of crosstalk. OSB uses Lagrange multipliers to enforce constraints that are coupled over frequencies. However, finding the optimal Lagrange multipliers can become complex when more than two users are considered. Starting from the single user case, this paper presents a number of properties, which are then extended to the multi-user case and lead to an efficient search algorithm for the Lagrange multipliers. Simulations show that the number of Lagrange multiplier evaluations is as small as 40, independent of the number of users, which is much faster than currently known search algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A low complexity optimal spectrum balancing algorithm for digital subscriber lines

In modern DSL systems, multi-user crosstalk is a major source of performance degradation. Optimal Spectrum Balancing (OSB) is a centralized algorithm that mitigates the effect of crosstalk by allocating optimal transmit spectra to all interfering DSL modems. By the use of Lagrange multipliers the algorithm decouples the spectrum management problem into per-tone optimization problems. The remain...

متن کامل

Computationally Efficient Optimal Power Allocation Algorithm for Multicarrier Communication Systems

We present an optimal, efficient power allocation algorithm for discrete multitone modulation (DMT). Using efficient lookup table searches and a Lagrange multiplier bisection search, our algorithm converges much faster to the optimal solution than existing techniques and can replace the use of suboptimal methods because of its low computational complexity. A fast algorithm is developed and pseu...

متن کامل

A Hybrid Meta-Heuristic Algorithm for Dynamic Spectrum Management in Multiuser Systems: Combining Simulated Annealing and Non-Linear Simplex Nelder-Mead

One of the major sources of performance degradation of current Digital Subscriber Line systems is the electromagnetic coupling among different twisted pairs within the same cable bundle (crosstalk). Several algorithms for Dynamic Spectrum management have been proposed to counteract the crosstalk effect but their complexity remains a challenge in practice. Optimal Spectrum Balancing (OSB) is a c...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

Computationally efficient optimal power allocation algorithms for multicarrier communication systems

In this paper, we present an optimal, computationally efficient, integer-bit power allocation algorithm for discrete multitone modulation. Using efficient lookup table searches and a Lagrange-multiplier bisection search, our algorithm converges faster to the optimal solution than existing techniques and can replace the use of suboptimal methods because of its low computational complexity. Fast ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005